Local Optima Network Analysis of Multi-Attribute Vehicle Routing Problems
نویسندگان
چکیده
Multi-Attribute Vehicle Routing Problems (MAVRP) are variants of (VRP) in which, besides the original constraint on vehicle capacity present Capacitated Problem (CVRP), other attributes that model diverse real-life system characteristics present. Among most common studied literature and route duration constraints. The influence these restrictions overall structure problem performance local search algorithms used to solve it has yet be well known. This paper aims explain impact constraints different VRP through alterations underlying space they cause. We focus Local Optima Network Analysis (LONA) for multiple Traveling Salesman (m-TSP) with (DVRP), both (DCVRP) results indicate measures obtained a sample optima provide valuable information behavior landscape under modifications problem’s Additionally, we use LONA difficulty instances solving by algorithms.
منابع مشابه
A unified solution framework for multi-attribute vehicle routing problems
Vehicle routing attributes are extra characteristics and decisions that complement the academic problem formulations and aim to properly account for real-life application needs. Hundreds of methods have been introduced in recent years for specific attributes, but the development of a single, general-purpose algorithm, which is both efficient and applicable to a wide family of variants remains a...
متن کاملReducing Local Optima in Single-Objective Problems by Multi-objectivization
One common characterization of how simple hill climbing optimization methods can fail is that they become trapped in local op tima a state where no small modi cation of the current best solution will produce a solution that is better This measure of better depends on the performance of the solution with respect to the single objective be ing optimized In contrast multi objective optimization MO...
متن کاملMatheuristics for a Multi-attribute Profit Collecting Vehicle Routing Problem
This paper studies a multi-attribute profit collecting vehicle routing problem, which arises in the collection operations of a charity organisation in the UK. The problem involves a heterogeneous fleet consisting of vehicles of different capacities, mandatory visits to a subset of vertices, time windows, rest requirements associated with maximum driving and working times, and partial collection...
متن کاملGeneral solution approaches for multi-attribute vehicle routing and scheduling problems
The Vehicle Routing Problem (CVRP) involves designing least cost delivery routes to service a geographically-dispersed customer set while respecting vehicle-capacity constraints. This NP-hard combinatorial optimization problem is linked with multiple applications in logistics, telecommunications, robotics, manufacturing and assembly-line design, crisis management in military and humanitarian fr...
متن کاملComparing Two-Echelon and Single-Echelon Multi-Objective Capacitated Vehicle Routing Problems
This paper aims to compare a two-echelon and a single-echelon distribution system. A mathematical model for the Single-Echelon Capacitated Vehicle Routing Problem (SE-CVRP) is proposed. This SE-CVRP is the counterpart of Two-Echelon Capacitated Vehicle Routing Problem (2E-CVRP) introduced in the authors’ previous work. The proposed mathematical model is Mixed-Integer Non-Linear Programming (MIN...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2022
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math10244644